By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

Table of Contents
Search This Issue
Volume 30, Issue 4, pp. 1041-1383

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

An Algorithmic Regularity Lemma for Hypergraphs

Andrzej Czygrinow and Vojtech Rödl

pp. 1041-1066

BibTeX  Abstract Full Text:  PDF

A Polynomial Approximation Algorithm for the Minimum Fill-In Problem

Assaf Natanzon, Ron Shamir, and Roded Sharan

pp. 1067-1079

BibTeX  Abstract Full Text:  PDF

Parallel Complexity of Computations with General and Toeplitz-Like Matrices Filled with Integers and Extensions

Victor Y. Pan

pp. 1080-1125

BibTeX  Abstract Full Text:  PDF

From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols

Christian Scheideler and Berthold Vöcking

pp. 1126-1155

BibTeX  Abstract Full Text:  PDF

Determining Consensus Numbers

Eric Ruppert

pp. 1156-1168

BibTeX  Abstract Full Text:  PDF

Early Detection of Message Forwarding Faults

Amir Herzberg and Shay Kutten

pp. 1169-1196

BibTeX  Abstract Full Text:  PDF

The Density of Weakly Complete Problems under Adaptive Reductions

Jack H. Lutz and Yong Zhao

pp. 1197-1210

BibTeX  Abstract Full Text:  PDF

A Finite State Version of the Kraft--McMillan Theorem

Frédérique Bassino, Marie-Pierre Béal, and Dominique Perrin

pp. 1211-1230

BibTeX  Abstract Full Text:  PDF

An 8-Approximation Algorithm for the Subset Feedback Vertex Set Problem

Guy Even, Joseph (Seffi) Naor, and Leonid Zosin

pp. 1231-1252

BibTeX  Abstract Full Text:  PDF

Computationally Sound Proofs

Silvio Micali

pp. 1253-1298

BibTeX  Abstract Full Text:  PDF

The Complexity of Modular Graph Automorphism

V. Arvind, R. Beigel, and A. Lozano

pp. 1299-1320

BibTeX  Abstract Full Text:  PDF

Approximating Shortest Paths on a Nonconvex Polyhedron

Kasturi R. Varadarajan and Pankaj K. Agarwal

pp. 1321-1340

BibTeX  Abstract Full Text:  PDF

Taking a Walk in a Planar Arrangement

Sariel Har-Peled

pp. 1341-1367

BibTeX  Abstract Full Text:  PDF

Finding Sets Covering a Point with Application to Mesh-Free Galerkin Methods

Xiaoxu Han, Suely Oliveira, and David Stewart

pp. 1368-1383

BibTeX  Abstract Full Text:  PDF